Zero-Sum Nonlinear Polynomial Game for Planar Robots Coordination
نویسندگان
چکیده
منابع مشابه
Stochastic Recursive Zero-Sum Differential Game and Mixed Zero-Sum Differential Game Problem
Under the notable Issacs’s condition on the Hamiltonian, the existence results of a saddle point are obtained for the stochastic recursive zero-sum differential game and mixed differential game problem, that is, the agents can also decide the optimal stopping time. Themain tools are backward stochastic differential equations BSDEs and double-barrier reflected BSDEs. As the motivation and applic...
متن کاملAging theories and the zero-sum game.
For generations programmed mammal aging was widely thought to be theoretically impossible. However, new evolutionary mechanics concepts have led to renewed interest in programmed aging resulting in a schism between programmed and non-programmed proponents. This article argues that this lack of consensus is damaging medical research and therefore steps should be taken to pro-actively resolve the...
متن کاملMultiple attribute decision making with triangular intuitionistic fuzzy numbers based on zero-sum game approach
For many decision problems with uncertainty, triangular intuitionistic fuzzy number is a useful tool in expressing ill-known quantities. This paper develops a novel decision method based on zero-sum game for multiple attribute decision making problems where the attribute values take the form of triangular intuitionistic fuzzy numbers and the attribute weights are unknown. First, a new value ind...
متن کاملFeedback Zero-Sum Linear Quadratic Dynamic Game for Descriptor System
In this paper we present a Nash equilibrium problem of linear quadratic zero-sum dynamic games for descriptor system. We assume that the players give a linear feedback to the game. For the game with finite planning horizon we derive a differential Riccati type equation. For the game with infinite planning horizon we consider an algebraic Riccati type equation. The connection of the game solutio...
متن کاملZero-Sum Game Techniques for Approximate Nash Equilibria
We apply existing, and develop new, zero-sum game techniques for designing polynomial-time algorithms to compute additive approximate Nash equilibria in bimatrix games. In particular, we give a polynomial-time algorithm that given an arbitrary bimatrix game as an input, outputs either an additive 1 3 -Nash equilibrium or an additive 1 2 -well-supported Nash equilibrium; and we give a polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.09.229